Combining sceptical epistemic reasoning with credulous practical reasoning
نویسنده
چکیده
This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines existing argument games for sceptical reasoning in grounded semantics and credulous reasoning with preferred semantics.
منابع مشابه
Combining sceptical epistemic reasoning with credulous practical reasoning ( corrected version ) 1
This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines ...
متن کاملArgumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of non-monotonic reasoning proposed in [1]. Appropriate instances of the proposed proof procedures provide concrete proof procedures for concrete formalisms for non-monotonic reasoning, for example logic programming with negation as failure ...
متن کاملCredulous vs. Sceptical Semantics for Ordered Logic Programs
We present a semantic approach to the characterization of credulous and sceptical reasoning mechanisms, within the framework of ordered logic. One of the advantages of our approach is that it integrates thightly with "conservative" ordered logic semantics which is known to generalize "classical" (stable and wellfounded) logic programming semantics. This allows us to compare the conservative and...
متن کاملThe Complexity of Theorem Proving in Autoepistemic Logic
Autoepistemic logic is one of the most successful formalisms for nonmonotonic reasoning. In this paper we provide a proof-theoretic analysis of sequent calculi for credulous and sceptical reasoning in propositional autoepistemic logic, introduced by Bonatti and Olivetti [5]. We show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK ....
متن کاملA Computational Logic Approach to the Suppression Task
A novel approach to human conditional reasoning based on the three-valued Łukasiewicz logic is presented. We will demonstrate that the Łukasiewicz logic overcomes problems the sofar proposed Fitting logic has in reasoning with the suppression task. The approach can be implemented by an appropriate connectionist network. While adequately solving the suppression task, the approach gives rise to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006